Totally ordered $D$-class decompositions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Totally Ordered Commutative Semigroups

Let 5( + , < ) be a system consisting of a set S endowed with an associative binary operation + and a total ( = linear = simple) order relation < . The composition + and the relation < may be connected by either or both of the following conditions. MC (Monotone Condition). If a and b are elements of 5 such that ax+y ...

متن کامل

Reservation-Based Totally Ordered Multicasting

We present an innovative totally ordered multicast protocol that is based on reservation of buffers at the destinations and intermediate network bridges, rather than on an acknowledgment strategy. By introducing timestamps into the packets and by using a buffer reservation retract scheme, our protocol not only produces a global total order of packets but also solves the deadlock and starvation ...

متن کامل

QoS Preserving Totally Ordered Multicast

This paper studies the Quality of Service QoS guarantees of totally ordered multicast algo rithms The paper shows that totally ordered multicast can coexist with guaranteed predictable delays in certain network models The paper considers two reservation models constant bit rate CBR and variable bit rate VBR For these models the paper presents totally ordered multicast algorithms that preserve t...

متن کامل

Ordered Compactifications of Products of Two Totally Ordered Spaces

We describe the semilattice of ordered compactifications ofX×Y smaller than βoX×βoY whereX and Y are certain totally ordered topological spaces, and where βoZ denotes the Stone–Čech orderedor Nachbin-compactification of Z. These basic cases are used to illustrate techniques for describing the semilattice of ordered compactifications ofX×Y smaller than βoX×βoY for arbitrary totally ordered topol...

متن کامل

Poset Limits Can Be Totally Ordered

S. Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529–563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a kernel on the unit interval with the standard order, thus answering an open question of Janson. We provide two proofs: real-analytic and combinatorial. The co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1964

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1964-11231-3